Decoding with Symbol Erasures , Errors and List Decisions
نویسنده
چکیده
Vector Symbol Decoding (VSD) is compared with Reed-Solomon Decoding (RSD) as an outer code of a concatenated code for two examples, where the inner decoder may provide a combination of errors, erasures or list decisions for a symbol. One example is for idealized orthogonal inner code signals with random noise and soft inner code decisions. The other example is for multiple access fast frequency or pulse position hopping within the inner symbol. VSD with a randomly-chosen code shows an advantage over RSD error-erasure decoding for the examples.
منابع مشابه
A Recursive Method for Calculating Error Probabilities for a Reed-solomon Codeword with Bounded Distance Errors and Erasures Decoding
This paper is the second in a series of two papers dealing with methods for recursively calculating codeword error and erasure probabilities for Reed-So!ornon (RS) codewords. As with the previous paper [1], a single RS codeword is transmitted in a channel where each transmitted symbol experiences independent identically distributed (IID) noise or a channel where each symbol experiences independ...
متن کاملTwo Theorems in List Decoding
We prove the following results concerning the list decoding of error-correcting codes: 1. We show that for any code with a relative distance of δ (over a large enough alphabet), the following result holds for random errors: With high probability, for a ρ 6 δ− ε fraction of random errors (for any ε > 0), the received word will have only the transmitted codeword in a Hamming ball of radius ρ arou...
متن کاملBlock Network Error Control Codes and Syndrome-based Complete Maximum Likelihood Decoding
In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the scheme to correct a mixture of symbol errors and packet erasures and to detect symbol errors is studied. The idea of syndrome-based decoding and error detection...
متن کاملOn Optimal Erasure and List Decoding Schemes of Convolutional Codes
A modified Viterbi algorithm with erasures and list-decoding is introduced. This algorithm is shown to yield the optimal decoding rule of Forney with erasures and variable list-size. For the case of decoding with erasures, the optimal algorithm is compared to the simple algorithm of Yamamoto and Itoh. The comparison shows a remarkable similarity in simulated performance, but with a considerably...
متن کاملVector symbol decoding with list inner symbol decisions
Abstract Error correcting codes can play a key role in improving the efficiency and reliability of wireless communications. Concatenated codes have the advantages that: 1) breaking the task into stages simplifies decoding, and 2) performance is good against clustered bit errors, fading and bursty interference. Reed-Solomon codes (maximum distance codes) have been popular as an outer code of con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005